Cubic vertex-transitive graphs on up to 1280 vertices
نویسندگان
چکیده
A graph is called cubic and tetravalent if all of its vertices have valency 3 and 4, respectively. It is called vertex-transitive and arc-transitive if its automorphism group acts transitively on its vertex-set and on its arcset, respectively. In this paper, we combine some new theoretical results with computer calculations to construct all cubic vertex-transitive graphs of order at most 1280. In the process, we also construct all tetravalent arc-transitive graphs of order at most 640.
منابع مشابه
Cubic Vertex-Transitive Non-Cayley Graphs of Order 8p
A graph is vertex-transitive if its automorphism group acts transitively on its vertices. A vertex-transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this paper, the cubic vertextransitive non-Cayley graphs of order 8p are classified for each prime p. It follows from this classification that there are two sporadic and two infini...
متن کاملEfficient domination in cubic vertex-transitive graphs
An independent set of vertices S of a graph dominates the graph efficiently if every vertex of the graph is either in S or has precisely one neighbour in S. In this paper we prove that a connected cubic vertex-transitive graph on a power of 2 vertices has a set that dominates it efficiently if and only if it is not isomorphic to a Möbius ladder. This is a preprint of an article accepted for pub...
متن کاملCubic edge-transitive graphs of order 2p3
Let p be a prime. It was shown by Folkman (J. Combin. Theory 3 (1967) 215) that a regular edge-transitive graph of order 2p or 2p is necessarily vertex-transitive. In this paper an extension of his result in the case of cubic graphs is given. It is proved that, with the exception of the Gray graph on 54 vertices, every cubic edge-transitive graph of order 2p is vertex-transitive. c © 2003 Elsev...
متن کاملReciprocal Degree Distance of Grassmann Graphs
Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.
متن کاملConstructing the Vertex-Transitive Graphs of Order 24
This paper describes the construction of all the vertex-transitive graphs on 24 vertices, thus extending the currently available catalogues. This construction differs significantly from previous constructions of the vertex-transitive graphs of order up to 23 in that we are forced to use far more sophisticated group-theoretic techniques. We include an analysis of all the symmetric graphs on 24 v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 50 شماره
صفحات -
تاریخ انتشار 2013